An Introduction to Turbo Codes
نویسنده
چکیده
| A tutorial introduction to the new class of binary parallel concatenated recursive systematic convolutional codes termed turbo codes is presented. It is shown that such codes are in fact linear block codes, and the encoding operation can be viewed as a modulo-2 multiplication of the information sequence with a generator matrix. A framework for analyzing the performance of turbo codes is proposed that utilizes the union bound and the weight distribution of the code. Analytical results for several di erent short block length turbo codes are presented and compared to related convolutional codes.
منابع مشابه
An approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملAn Approach to Increasing Reliability Using Syndrome Extension
Computational errors in numerical data processing may be detected efficiently by using parity values associated with real number codes, even when inherent round off errors are allowed in addition to failure disruptions. This paper examines correcting turbo codes by straightforward application of an algorithm derived for finite-field codes, modified to operate over any field. There are syndromes...
متن کاملAn Introduction to Algebraic Geometry codes
We present an introduction to the theory of algebraic geometry codes. Starting from evaluation codes and codes from order and weight functions, special attention is given to one-point codes and, in particular, to the family of Castle codes.
متن کاملAn Efficient SISO Algorithm for Reed-Solomon Codes
There has been renewed interest in iterative decoding algorithms for concatenated codes since the introduction of Turbo codes. Such iterative methods are built on top of soft-insoft-out algorithms. Powerful concatenated codes may be constructed with linear block codes codes as constituent codes. Such codes can be better alternatives to Turbo Codes either when high coding rates or when short int...
متن کاملOn the Statistical Theory of Turbo-Codes
A statistical theory of turbo-codes, treated as a special family of convolutional codes with a low-density parity-check matrix, is developed. The basic ideas are: the representation of the transposed parity-check matrix of turbo-codes as a product of a sparse (multiple) scrambler matrix and the transposed parity-check matrix of the basic code, the introduction of a special statistical ensemble ...
متن کامل